Comparing Gang Scheduling with Dynamic Space Sharing on Symmetric Multiprocessors Using Automatic Self-Allocating Threads (ASAT)
نویسندگان
چکیده
This work considers the best way to handle a diverse mix of multi-threaded and single-threaded jobs running on a single Symmetric Parallel Processing system. The traditional approaches to this problem are free scheduling, gang scheduling, or space sharing. This paper examines a less common technique called dynamic space sharing. One approach to dynamic space sharing, Automatic Self Allocating Threads (ASAT), is compared to all of the traditional approaches to scheduling a mixed load of jobs. Performance results for ASAT scheduling, gang scheduling, and free scheduling are presented. ASAT scheduling is shown to be the superior approach to mixing multi-threaded work with single threaded work.
منابع مشابه
Automatic Self - Allocating Threads ( Asat ) on Ansgi
Automatic Self Allocating Threads (ASAT) is proposed as a way to balance the number of active threads across a shared-memory multiprocessing system. Our approach is signiicant in that it is designed for a system running multiple jobs, and it considers the load of all running jobs in its thread allocation. In addition, the overhead of ASAT is suuciently small so that the run times of all jobs im...
متن کاملManaging the Overall Balance of Operating System Threads on a Multiprocessor Using Automatic Self-Allocating Threads (ASAT)
A multi-threaded runtime environment which supports lightweight threads can be used to support many aspects of parallel processing including: virtual processors, concurrent objects, and compiler run-time environments. This work focuses on the area of compiler run-time environments. Such a library must depend on the underlying thread mechanism provided by the operating system. Threads working on...
متن کاملPerformance Analysis and Prediction of Processor Scheduling Strategies in Multiprogrammed Shared-Memory Multiprocessors
Small-scale shared-memory multiprocessors are commonly used in a workgroup environment where multiple applications, both parallel and sequential, are executed concurrently while sharing the processors and other system resources. To utilize the processors eeciently, an eeective scheduling strategy is required. In this paper, we use performance data obtained from an SGI multiprocessor to evaluate...
متن کاملImprovements in Parallel Job Scheduling Using Gang Service
Gang scheduling has been widely used as a practical solution to the dynamic parallel job scheduling problem. Parallel threads of a single job are scheduled for simultaneous execution on a parallel computer even if the job does not fully utilize all available processors. Non allocated processors go idle for the duration of the time quantum assigned to the threads. In this paper we propose a clas...
متن کاملAutomatic Self-Allocating Threads (ASAT) on the Convex Exemplar
Parallel processing systems have an advantage over traditional supercomputers in price/performance, but traditional supercomputers retain a signiicant advantage over parallel processing systems in the area of exibility. Traditional supercomputers can easily handle a mix of interactive, batch, scalar, vector, parallel, and large memory jobs simultaneously while maintaining high utilization. Ofte...
متن کامل